Optimal enclosing regions in planar graphsBIENSTOCK, D; MONMA, C. L.Networks (New York, NY). 1989, Vol 19, Num 1, pp 79-94, issn 0028-3045, 16 p.Article

Revisiting a result of KoCINTIOLI, P; SILVESTRI, R.Information processing letters. 1997, Vol 61, Num 4, pp 189-194, issn 0020-0190Article

Incremental condition estimationBISCHOF, C. H.SIAM journal on matrix analysis and applications. 1990, Vol 11, Num 2, pp 312-322, issn 0895-4798, 11 p.Article

Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fieldsFITCHAS, N; GALLIGO, A; MORGENSTERN, J et al.Journal of pure and applied algebra. 1990, Vol 67, Num 1, pp 1-14, issn 0022-4049, 14 p.Article

Parallel algorithms for cographs and parity graphs wirth applicationsADHAR, G. S; PENG, S.Journal of algorithms (Print). 1990, Vol 11, Num 2, pp 252-284, issn 0196-6774, 33 p.Article

Lower bounds for ShellsortPLAXTON, C. G; SUEL, T.Journal of algorithms (Print). 1997, Vol 23, Num 2, pp 221-240, issn 0196-6774Article

Arboricity and bipartite subgraph listing algorithmsEPPSTEIN, D.Information processing letters. 1994, Vol 51, Num 4, pp 207-211, issn 0020-0190Article

An O(n^1.5) algforithm to color proper circular arcsWEI-KUAN SHIH; WEN-LIAN HSU.Discrete applied mathematics. 1989, Vol 25, Num 3, pp 321-323, issn 0166-218X, 3 p.Article

An algorithm for polynomial multiplication that does not depent on the ring constantsKAMINSKI, M.Journal of algorithms (Print). 1988, Vol 9, Num 1, pp 137-147, issn 0196-6774Article

SNPs problems, complexity, and algorithmsLANCIA, Giuseppe; BAFNA, Vineet; ISTRAIL, Sorin et al.Lecture notes in computer science. 2001, pp 182-193, issn 0302-9743, isbn 3-540-42493-8Conference Paper

On the correctness of linear closure in a class of estimation algorithmsKURKINA, M. V.Computational mathematics and mathematical physics. 1999, Vol 39, Num 4, pp 668-673, issn 0965-5425Article

A simple, efficient algorithm for maximum finding on ringsHIGHAM, L; PRZYTYCKA, T.Information processing letters. 1996, Vol 58, Num 6, pp 319-324, issn 0020-0190Article

A simple modification of Xunrang and Yuzhang's HEAPSORT variant improving its complexity significantlyWEGENER, I.Computer journal (Print). 1993, Vol 36, Num 3, pp 286-288, issn 0010-4620Article

A gray code for the ideals of a forest posetKODA, Y; RUSKEY, F.Journal of algorithms (Print). 1993, Vol 15, Num 2, pp 324-340, issn 0196-6774Article

An O (n²) algorithm for the satisfiability problem of a subset of propositional sentences in CNF that includes all horn sentencesARVIND, V; BISWAS, S.Information processing letters. 1987, Vol 24, Num 1, pp 67-69, issn 0020-0190Article

A reliable algorithm to compute the spectral set of a polytope of polynomials to prescribed accuracyPALURI, Nataraj S. V; BARVE, Jayesh J.Journal of dynamic systems, measurement, and control. 2006, Vol 128, Num 2, pp 400-405, issn 0022-0434, 6 p.Article

Quantified constraints: Algorithms and complexityBÖRNER, Ferdinand; BULATOV, Andrei; JEAVONS, Peter et al.Lecture notes in computer science. 2003, pp 58-70, issn 0302-9743, isbn 3-540-40801-0, 13 p.Conference Paper

Query learning of bounded-width OBDDsNAKAMURA, A.Theoretical computer science. 2000, Vol 241, Num 1-2, pp 83-114, issn 0304-3975Article

A definition of discovery in terms of generalized descriptional complexityBANNAI, H; MIYANO, S.Lecture notes in computer science. 1999, pp 316-318, issn 0302-9743, isbn 3-540-66713-XConference Paper

A note on minimizing submodular functionsNAGAMOCHI, H; IBARAKI, T.Information processing letters. 1998, Vol 67, Num 5, pp 239-244, issn 0020-0190Article

Theoretical aspects of computer softwareHAGIYA, Masami.Information and computation (Print). 1996, Vol 125, Num 2, pp 77-170, issn 0890-5401Serial Issue

On the complexity of certified write-all algorithmsMARTEL, C; SUBRAMONIAN, R.Journal of algorithms (Print). 1994, Vol 16, Num 3, pp 361-387, issn 0196-6774Article

Fast two-dimensional pattern matchingBAEZA-YATES, R; REGNIER, M.Information processing letters. 1993, Vol 45, Num 1, pp 51-57, issn 0020-0190Article

Generalized string matchingABRAHAMSON, K.SIAM journal on computing (Print). 1987, Vol 16, Num 6, pp 1039-1051, issn 0097-5397Article

Weak arithmeticsCEGIELSKI, Patrick; MORE, Malika.Theoretical computer science. 2004, Vol 322, Num 1, issn 0304-3975, 233 p.Conference Proceedings